Shortest Path的例句大全

Dijkstra by C is so great for solving algorithm find the shortest path with weight!

迪杰斯特拉的C是如此之大的求解算法寻找最短路径的重量!

Low-cost shortest path tree is a commonly-used multicast tree type.

低代价最短路径树是一种广泛使用的多播树.

This paper is to study the shortest path problem with fuzzy parameter.

本文研究具有模糊参数的最短路径问题.

FIGURE 5. Determining the shortest path from the origin to the destination.

图5. 决定从出发点到目标点的最短的路径.

Specific functions include a 2-point shortest path between the dynamic display, the segment length annotation.

实现了VB, MO最 短路径搜索.具体功能包括,2点间最短路径动态显示, 各段长度标注.

This paper deals with TSP by transform TSP to a special Shortest Path Problem.

本文将解决TSP问题转化为一种特殊的最短路问题.

Prim algorithm to find shortest path in graph complete source code, has been tested.

普里姆算法寻找最短路径图中完整的源代码, 已经过测试.

The OSPF open shortest path first refresh mechanism can cause periodic bursts of traffic on networks.

协议的报文刷新机制会产生大量的报文,给网络带来很大的突发流量.

SAP matrix graph theory algorithm for getting the basic idea is to map shortest path problem.

图论算法求SAP矩阵的基本思想是图的最短路的问题.

Requirements: on the network using Dijkstra algorithm to find single-source shortest path.

要求: 对有向网络用Dijkstra算法 求出 单源 最短路径.

A multiobjective shortest path evolutionary algorithm is presented for acyclic directed graph.

提出一种无圈有向图条件下的多目标最短路径进化算法.

Redundant links that are not part of the shortest path tree are blocked.

不是最短路径的备援连结将被阻隔.

Link State algorithm called the shortest path first SPF ( Short Path First ) algorithm.

链路状态算法又叫最短路径优先SPF ( ShortPathFirst ) 算法.

Node path length can be calculated in accordance with the shortest path!

可以根据节点路径长度计算最短路径! -Vc6.

This article introduce a way called layer shortest path way based on conventional shortest path way.

论文中提出了一种基于常规最短路径方法的分词算法:层进式最短路径分词方法.

OSPF ( Open Shortest Path First) is classified as an IGP, which are used within autonomous systems.

OSPF（开放最短路径优先）协议属于内部网关协议，运行在一个自主系统内部。

Therefor, the performance of the shortest path tree generated by FLSPT or the DDSP is same, but the efficiency of FLSPT is better than DDSP.

因此，FLSPT算法计算得出的最短路径树性能与DDSP算法一样，但计算效率比DDSP算法高。

Usually, it encounters dynamic group membership in practical multicast applications. Adopting the idea of Greedy algorithm, this thesis presents a delay constraint dynamic multicast routing algorithm DDMP, based on k-shortest paths, finds a path for the node which apply for join in the tree.

最后，由于在实际组播应用中，通常面临着组播成员的动态变化的问题，论文借鉴了贪婪算法的思想，提出一个基于K条最短路径算法的时延约束动态组播路由算法DDMP。

This paper presented TDRA ( Table-lookup Deterministic Routing Algorithm) in triple-based hierarchical interconnection network, which always delivers the message along the approximately shortest path between any two nodes.

针对基三分层互连网络，提出一种基于查表的使消息沿两节点间近似最短路径传递的分布式确定路由算法TDRA。

Understanding of shortest path problem, and use the Dijkstra shortest path algorithm to solve the problem.

理解最短路径问题, 并使用Dijkstra算法解决最短路径问题.